WORST_CASE(?,O(n^2)) Solution: --------- "0" :: [] -(0)-> "A"(12, 0) "0" :: [] -(0)-> "A"(0, 0) "0" :: [] -(0)-> "A"(0, 13) "0" :: [] -(0)-> "A"(1, 9) "0" :: [] -(0)-> "A"(14, 14) "0" :: [] -(0)-> "A"(15, 15) "0" :: [] -(0)-> "A"(15, 14) "0" :: [] -(0)-> "A"(13, 15) "a__f" :: ["A"(12, 0)] -(4)-> "A"(12, 0) "a__p" :: ["A"(0, 0)] -(1)-> "A"(15, 0) "cons" :: ["A"(0, 13) x "A"(0, 0)] -(13)-> "A"(0, 13) "cons" :: ["A"(0, 1) x "A"(0, 0)] -(1)-> "A"(15, 1) "cons" :: ["A"(0, 0) x "A"(0, 0)] -(0)-> "A"(14, 0) "f" :: ["A"(0, 13)] -(13)-> "A"(0, 13) "f" :: ["A"(0, 0)] -(0)-> "A"(0, 0) "f" :: ["A"(12, 0)] -(0)-> "A"(12, 0) "mark" :: ["A"(0, 13)] -(1)-> "A"(12, 0) "p" :: ["A"(0, 13)] -(13)-> "A"(0, 13) "p" :: ["A"(0, 0)] -(0)-> "A"(15, 0) "s" :: ["A"(12, 0)] -(12)-> "A"(12, 0) "s" :: ["A"(0, 0)] -(0)-> "A"(0, 0) "s" :: ["A"(0, 13)] -(13)-> "A"(0, 13) Cost Free Signatures: --------------------- "0" :: [] -(0)-> "A"_cf(2, 0) "0" :: [] -(0)-> "A"_cf(0, 0) "0" :: [] -(0)-> "A"_cf(8, 0) "a__f" :: ["A"_cf(2, 0)] -(1)-> "A"_cf(0, 0) "a__f" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0) "a__p" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(2, 0) "a__p" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0) "cons" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(0, 0) "f" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0) "f" :: ["A"_cf(2, 0)] -(0)-> "A"_cf(2, 0) "mark" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0) "p" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(4, 0) "p" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0) "s" :: ["A"_cf(2, 0)] -(2)-> "A"_cf(2, 0) "s" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0) Base Constructors: ------------------ "\"0\"_A" :: [] -(0)-> "A"(1, 0) "\"0\"_A" :: [] -(0)-> "A"(0, 1) "\"cons\"_A" :: ["A"(0, 0) x "A"(0, 0)] -(0)-> "A"(1, 0) "\"cons\"_A" :: ["A"(0, 1) x "A"(0, 0)] -(1)-> "A"(0, 1) "\"f\"_A" :: ["A"(1, 0)] -(0)-> "A"(1, 0) "\"f\"_A" :: ["A"(0, 1)] -(1)-> "A"(0, 1) "\"p\"_A" :: ["A"(0, 0)] -(0)-> "A"(1, 0) "\"p\"_A" :: ["A"(0, 1)] -(1)-> "A"(0, 1) "\"s\"_A" :: ["A"(1, 0)] -(1)-> "A"(1, 0) "\"s\"_A" :: ["A"(0, 1)] -(1)-> "A"(0, 1)